Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically
نویسندگان
چکیده
ion and Resolution Modulo AC: How to Verify Diffie-Hellman-like Protocols Automatically ? Jean Goubault-Larrecq a,∗ Muriel Roger b,1 Kumar Neeraj Verma c,1 aLSV/CNRS UMR 8643 & INRIA Futurs projet SECSI & ENS Cachan 61, av. du président-Wilson, 94235 Cachan Cedex, France bDRT/LIST/DTSI/SLA/LSL CEA, centre de Saclay, 91191 Gif-sur-Yvette, France cTechnische Universität München, Institut für Informatik / I2 Boltzmannstraße 3, 85748 Garching, Germany
منابع مشابه
Diffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملComputationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation
Recently, it has been proved that computational security can be automatically verified using the Dolev-Yao abstraction. We extend these results by adding a widely used component for cryptographic protocols: Diffie-Hellman exponentiation. Thus our main result is: if the Decisional Diffie-Hellman assumption is verified and the cryptographic primitives used to implement the protocol are secure, th...
متن کاملJ . Goubault − Larrecq and K . N . Verma Alternating Two − Way AC − Tree Automata Research
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols, some of them with a unit (AC1). This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question for intersections of such autom...
متن کاملA NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملFinite Approximations of Terms up to Rewriting
A technique is presented for computing a finite over-approximation of a language of terms, modulo rewriting. The language is represented by an arbitrary term grammar. The approximation is a term grammar as well, and it already embodies rewriting, i.e. its language includes all the original terms and all their possible rewritings. We propose this technique to statically verify cryptographic prot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Algebr. Program.
دوره 64 شماره
صفحات -
تاریخ انتشار 2005